New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model
نویسندگان
چکیده
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The running time of our algorithms for maximum perimeter problem is O(n) which improve over the previous results of O(n) in [12]. For maximum are problem with different size of parallel line segments [12] gives O(n) algorithms. We give O(n log n) algorithms with the assumption that all parallel line segments have the same size.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملNew Results on Stabbing Segments with a Polygon
We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element of S. Given a segment set S, we study the problem of finding a simple polygon P stabbing S in a way that some measure of P (such as area or pe...
متن کاملAn Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection
Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.
متن کاملPrize-collecting Point Sets
Given a set of points P in the plane and profits (or prizes) π : P → R≥0 we want to select a maximum profit set X ⊆ P which maximizes P p∈X π(p) − μ(X) for some particular criterion μ(X). In this paper we consider four such criteria, namely the perimeter and the area of the smallest axis-parallel rectangle containing X, and the perimeter and the area of the convex hull conv(X) of X. Our key res...
متن کاملFinding Optimal Bipartitions of Points and Polygons
We give eecient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. In particular, we give an O(n 2) algorithm for partitioning a set of n points into two subsets in order to minimize the sum of the perimeters of the convex hulls. We also examine the problems of minimizing the maximum of the perimeters, or the sum/maximum of the areas, for t...
متن کامل